Queues with Workload-Dependent Arrival and Service Rates

Finite-Buffer Queues with Workload-Dependent Service and Arrival Rates

We consider M/G/1 queues with workload-dependent arrival rate, service speed, and restricted accessibility. The admittance of customers typically depends on the amount of work found upon arrival in addition to its own service requirement. Typical examples are the finite dam, systems with customer impatience and queues regulated by the complete rejection discipline. Our study is motivated by que...

Queues with Workload-Dependent Arrival and Service Rates

We consider two types of queues with workload-dependent arrival rate and service speed. Our study is motivated by queueing scenarios where the arrival rate and/or speed of the server depends on the amount of work present, like production systems and the Internet. First, in the M/G/1 case, we compare the steady-state distribution of the workload (both at arbitrary epochs and at arrival instants)...

Optimal Selection of Arrival and Service Rates in Tandem Queues

We consider n M/M/1 queues in series. At queue one the arrival and service rates are chosen in pair from a finite set whenever there are arrivals or service completions at any queue. Customers arriving to queue k (k = 1, 2, ..., n − 1) must go on to queue k + 1 after finishing service at server associated queue k. Customers arriving to queue n leave the system after finishing service at the la...

On Queues with Markov Modulated Service Rates

In this paper, we consider a queue whose service speed changes according to an external environment that is governed by a Markov process. It is possible that the server changes its service speed many times while serving a customer. We derive first and second moments of the service time of customers in system using first step analysis to obtain an insight on the service process. In fact, we obta...

Single retrial queues with service option on arrival